- Inverse Fast Fourier Transform (IFFT)
-
обратное быстрое преобразование Фурье
English-Russian dictionary of modern telecommunications. 2003.
Inverse Fast Fourier Transform (IFFT)
Смотреть что такое "Inverse Fast Fourier Transform (IFFT)" в других словарях:
Fast-Fourier-Transformation — Die schnelle Fourier Transformation (englisch fast Fourier transform, daher meist FFT abgekürzt) ist ein Algorithmus zur effizienten Berechnung der Werte einer diskreten Fourier Transformation (DFT). Bei dem Algorithmus handelt es sich um ein… … Deutsch Wikipedia
Fast Fourier-Transformation — Die schnelle Fourier Transformation (englisch fast Fourier transform, daher meist FFT abgekürzt) ist ein Algorithmus zur effizienten Berechnung der Werte einer diskreten Fourier Transformation (DFT). Bei dem Algorithmus handelt es sich um ein… … Deutsch Wikipedia
IFFT — Inverse Fast Fourier Transform (Academic & Science » Mathematics) … Abbreviations dictionary
IFFT — abbr. Inverse Fast Fourier Transform (mathematics) … Dictionary of abbreviations
Schnelle Fourier-Transformation — Eine schnelle Fourier Transformation (englisch fast Fourier transform, daher meist FFT abgekürzt) ist ein Algorithmus zur effizienten Berechnung der Werte einer diskreten Fourier Transformation (DFT). Bei solchen Algorithmen handelt es sich… … Deutsch Wikipedia
Passive radar — systems (also referred to as passive coherent location and passive covert radar) encompass a class of radar systems that detect and track objects by processing reflections from non cooperative sources of illumination in the environment, such as… … Wikipedia
Vocaloid — 2 Editor (English version) Developer(s) … Wikipedia
IEEE 802.11a-1999 — or 802.11a, is an amendment to the IEEE 802.11 specification that added a higher throughput of up to 54 Mbit/s by using the 5 GHz band. It has seen widespread worldwide implementation, particularly within the corporate workspace. The amendment… … Wikipedia
Overlap–add method — The overlap–add method (OA, OLA) is an efficient way to evaluate the discrete convolution of a very long signal x[n] with a finite impulse response (FIR) filter h[n]: where h[m]=0 for m outside the region [1, M]. The concept is to divide the… … Wikipedia
Overlap–save method — Overlap–save is the traditional name for an efficient way to evaluate the discrete convolution between a very long signal x[n] and a finite impulse response (FIR) filter h[n] … Wikipedia
Overlap-save method — Overlap save is the traditional name for an efficient way to evaluate the discrete convolution between a very long signal x [n] with a finite impulse response (FIR) filter h [n] ::egin{align}y [n] = x [n] * h [n] stackrel{mathrm{def{=} sum {m=… … Wikipedia
